Synthesizing datapath circuits for FPGAs with emphasis on area minimization

Large circuits, whether they are arithmetic, digital signal processing, switching, or processors, typically contain a greater portion of highly regular datapath logic. Datapath synthesis algorithms preserve these regular structures, so they can be exploited by packing, placement, and routing tools for speed or density. Typical datapath synthesis algorithms , however, sacrifice area to gain regularity. Current algorithms can have as much as 30% to 40% area inflation when compared with traditional flat synthesis algorithms. This paper describes a datapath synthesis algorithm with very low area overhead, which is an enhancement to the module compaction algorithm proposed in [8]. We propose two word-level optimizations — multiplexer tree collapsing and operation reordering. They reduce the area inflation to 3%–8% as compared with flat synthesis. Our synthesis results also retain significant amount of regularity from the original designs.